منابع مشابه
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown that tree automata can be used as a general framework for fine grained XML query optimization. We define the “relevant nodes” of a query as those nodes that a minimal automaton must touch in order to answer the query. Thi...
متن کاملRelational Approach to XPath Query Optimization
This thesis contributes to the Pathfinder project which aims at creating an XQuery compiler on top of a relational database system. Currently, it is being implemented on top of MonetDB, a main memory database system. For optimization and portability purposes, Pathfinder first compiles an XQuery expression into its own relational algebra, before translating the query into the query language of t...
متن کاملRelational Approach to Logical Query Optimization of XPath
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great potential. Recently, effective relational storage schemes and index structures have been proposed as well as special-purpose join operators to speed up querying of XML data using XPath/XQuery. In this paper, we address the...
متن کاملXSLT and XPath Optimization
Recent releases of Saxon support XQuery 1.0 as well as XSLT 2.0. However, the XQuery processor is an in-memory processor, not a database query engine. Optimizing database queries is an entirely different art, because it relies so heavily on rearranging queries to exploit persistent indexes. An in-memory processor does not have this opportunity, because the only indexes available are those that ...
متن کاملQuery Based Learning of XPath Fragments
XPath is a language for XML document navigation. It is part of many XML related applications and standards such as XSLT, Document Object Models, XQuery, XLink, etc. This paper studies active forms of learning XPath expressions. In particular, we show nonlearnability of the XPath fragments using the equivalence and membership queries. In response to these negative results and visualisation probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2010
ISSN: 2150-8097
DOI: 10.14778/1920841.1920954